Sharpening Geometric Inequalities using Computable Symmetry Measures

نویسندگان

  • René Brandenberg
  • Stefan König
چکیده

Many classical geometric inequalities on functionals of convex bodies depend on the dimension of the ambient space. We show that this dimension dependence may often be replaced (totally or partially) by different symmetry measures of the convex body. Since these coefficients are bounded by the dimension but possibly smaller, our inequalities sharpen the original ones. Since they can often be computed efficiently, the improved bounds may also be used to obtain better bounds in approximation algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Sharpening of Some Inequalities via Abstract Convexity

One of the application areas of abstract convexity is inequality theory. In this work, the authors seek to derive new inequalities by sharpening well-known inequalities by the use of abstract convexity. Cauchy-Schwarz inequality, Minkowski inequality and well-known mean inequalities are studied in this sense, concrete results are obtained for some of them. Mathematics subject classification (20...

متن کامل

Some weighted operator geometric mean inequalities

In this paper, using the extended Holder- -McCarthy inequality, several inequalities involving the α-weighted geometric mean (0<α<1) of two positive operators are established. In particular, it is proved that if A,B,X,Y∈B(H) such that A and B are two positive invertible operators, then for all r ≥1, ‖X^* (A⋕_α B)Y‖^r≤‖〖(X〗^* AX)^r ‖^((1-α)/2) ‖〖(Y〗^* AY)^r ‖^((1-α)/2) ‖〖(X〗^* BX)^r ‖^(α/2) ‖〖(Y...

متن کامل

Lower Bounds for a Polynomial on a Basic Closed Semialgebraic Set Using Geometric Programming

Let f, g1, . . . , gm be elements of the polynomial ring R[x1, . . . , xn]. The paper deals with the general problem of computing a lower bound for f on the subset of Rn defined by the inequalities gi ≥ 0, i = 1, . . . ,m. The paper shows that there is an algorithm for computing such a lower bound, based on geometric programming, which applies in a large number of cases. For example, the algori...

متن کامل

Dilational Hilbert Scales and Deconvolutional Sharpening

Operationally, index functions of variable Hilbert scales can be viewed as generators for families of spaces and norms. Using a one parameter family of index functions based on the dilations of a given index function, a new class of scales (dilational Hilbert scales (DHS)) is derived which generates new interpolatory inequalities (dilational interpolatory inequalities (DII)) which have the ordi...

متن کامل

Sharp Spectral Bounds on Starlike Domains

We prove sharp bounds on eigenvalues of the Laplacian that complement the Faber–Krahn and Luttinger inequalities. In particular, we prove that the ball maximizes the first eigenvalue and minimizes the spectral zeta function and heat trace. The normalization on the domain incorporates volume and a computable geometric factor that measures the deviation of the domain from roundness, in terms of m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1310.4368  شماره 

صفحات  -

تاریخ انتشار 2013